Complexity theory - PDFSEARCH.IO - Document Search Engine

Complexity theory
Results: 3600

#	Item
821	zn poly: a library for polynomial arithmetic David Harvey, New York University January 8, 2009 David Harvey, New York University Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2011-07-17 23:06:27 Polynomials Computational number theory Computational complexity theory Algebra Digital signal processing Fast Fourier transform Fast Library for Number Theory Time complexity Multiplication Mathematics Abstract algebra Theoretical computer science
822	A Multi-Trajectory, Competition Model of Emergent Complexity in Human Social Organization DWIGHT W. READ Department of Anthropology and Department of Statistics, UCLA, Los Angeles, CAABSTRACT The repeated pattern Add to Reading List Source URL: www.sscnet.ucla.edu Language: English - Date: 2003-01-31 04:12:33 Zoology Megafauna Ethnology Complex systems theory Kinship Agent-based model Chiefdom Culture Social simulation Anthropology Science Sociology
823	CCCG 2011, Toronto ON, August 10–12, 2011 Space-efficient Algorithms for Empty Space Recognition among a Point Set in 2D and 3D Minati De∗† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Largest empty rectangle Algorithm Closest pair of points problem Reduction Computer science Computational geometry Beta skeleton Mathematics Applied mathematics Computational complexity theory
824	Richard Ryan Williams Computer Science Department Stanford University, Stanford, CAEmail: EDUCATION Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-09-18 23:56:44 ACM SIGACT Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Ryan Williams Symposium on Foundations of Computer Science Computational complexity theory SWAT and WADS conferences Algorithm Symposium on Parallelism in Algorithms and Architectures Theoretical computer science Computer science Applied mathematics
825	Structural Complexity of Vortex Flows by Diagram Analysis and Knot Polynomials Renzo L. Ricca Abstract In this paper I present and discuss with examples new techniques based Add to Reading List Source URL: www.matapp.unimib.it Language: English - Date: 2014-06-22 16:43:35 Mathematics Fluid dynamics Aerodynamics Linking number Vortex Tangle Projection Knot invariant Quantum turbulence Knot theory Topology Geometry
826	On the Theory of Average Case Complexity Shai Ben-Davidy Benny Chor Oded Goldreichz Michael Lubyx Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:24:22 Complexity classes Computability theory Mathematical optimization Structural complexity theory P versus NP problem NP-complete Turing reduction Decision problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
827	Parameterized Complexity-News The Newsletter of the Parameterized Complexity Community Volume 1, MayWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:15:19 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Feedback vertex set Graph coloring Vertex cover Dominating set Time complexity Theoretical computer science Computational complexity theory Applied mathematics
828	Algorithms Lecture 13: Randomized Minimum Cut [Fa’13] Jaques: But, for the seventh cause; how did you find the quarrel on the seventh cause? Touchstone: Upon a lie seven times removed:–bear your body more seeming, A Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:40 Spanning tree Combinatorial optimization Graph connectivity Analysis of algorithms Probabilistic complexity theory Randomized algorithm Minimum spanning tree Minimum cut Connectivity Theoretical computer science Mathematics Graph theory
829	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
830	Algorithmica:1-10 Algorithmica 9 1990Springer-VerlagNew York Inc. An Improved Parallel Algorithm for Integer GCD Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2011-02-28 05:21:13 Computational complexity theory Greatest common divisor Euclidean algorithm Number theory Time complexity Factorial Binary GCD algorithm Computational complexity of mathematical operations Mathematics Theoretical computer science Multiplicative functions

UPDATE